1,175 research outputs found

    Parallel Emergence of Rigidity and Collective Motion in a Family of Simulated Glass-Forming Polymer Fluids

    Full text link
    The emergence of the solid state in glass-forming materials upon cooling is accompanied by changes in both thermodynamic and viscoelastic properties and by a precipitous drop in fluidity. Here, we investigate changes in basic elastic properties upon cooling in a family of simulated polymer fluids, as characterized by a number of stiffness measures. We show that τα\tau_{\alpha} can be expressed quantitatively both in terms of measures of the material ``stiffness'', GpG_p and u2\langle u^2 \rangle, and the extent LL of cooperative particle exchange motion in the form of strings, establishing a direct relation between the growth of emergent elasticity and collective motion. Moreover, the macroscopic stiffness parameters, GpG_p, BB, and fs,qf_{s, q^*}, can all be expressed quantitatively in terms of the molecular scale stiffness parameter, kBT/u2k_{\mathrm{B}}T / \langle u^2 \rangle with kBk_{\mathrm{B}} being Boltzmann's constant, and we discuss the thermodynamic scaling of these properties. We also find that GpG_p is related to the cohesive energy density ΠCED\Pi_{\mathrm{CED}}, pointing to the critical importance of attractive interactions in the elasticity and dynamics of glass-forming liquids. Finally, we discuss fluctuations in the local stiffness parameter as a quantitative measure of elastic heterogeneity and their significance for understanding both the linear and nonlinear elastic properties of glassy materials.Comment: 69 pages, 18 figure

    Integrated Relative-Measurement-Based Network Localization and Formation Maneuver Control (Extended Version)

    Full text link
    This paper studies the problem of integrated distributed network localization and formation maneuver control. We develop an integrated relative-measurement-based scheme, which only uses relative positions, distances, bearings, angles, ratio-of-distances, or their combination to achieve distributed network localization and formation maneuver control in Rd(d2)\mathbb{R}^d (d \ge 2). By exploring the localizability and invariance of the target formation, the scale, rotation, and translation of the formation can be controlled simultaneously by only tuning the leaders' positions, i.e., the followers do not need to know parameters of the scale, rotation, and translation of the target formation. The proposed method can globally drive the formation errors to zero in finite time over multi-layer d ⁣+ ⁣1d\!+\!1-rooted graphs. A simulation example is given to illustrate the theoretical results.Comment: 12 pages; 7 figures, title corrected, DOI adde

    Angle-Displacement Rigidity Theory with Application to Distributed Network Localization

    Full text link
    This paper investigates the localization problem of a network in 2-D and 3-D spaces given the positions of anchor nodes in a global frame and inter-node relative measurements in local coordinate frames. It is assumed that the local frames of different nodes have different unknown orientations. First, an angle-displacement rigidity theory is developed, which can be used to localize all the free nodes by the known positions of the anchor nodes and local relative measurements (local relative position, distance, local relative bearing, angle, or ratio-of-distance measurements). Then, necessary and sufficient conditions for network localizability are given. Finally, a distributed network localization protocol is proposed, which can globally estimate the locations of all the free nodes of a network if the network is infinitesimally angle-displacement rigid. The proposed method unifies local-relative-position-based, distance-based, local-relative-bearing-based, angle-based, and ratio-of-distance-based distributed network localization approaches. The novelty of this work is that the proposed method can be applied in both generic and non-generic configurations with an unknown global coordinate frame in both 2-D and 3-D spaces

    Experimental Study on Variation Strategies for Complex Social Pedestrian Groups in Conflict Conditions

    Get PDF
    The paper concentrates on an experimental study of the variation strategies of complex social pedestrian groups in conflict conditions. We tracked the trajectories of group members and analysed the configuration of both the complex group and its subgroups when the groups walked through a narrowing passage, passed by an obstacle or faced counter flows. We summarized the variation strategies of complex groups when they faced these conflict conditions. The effect of groups on the crowd was also studied. It was found that groups could have significant effect on self-organization of the crowd. The results in the paper could be applied in modelling pedestrian group decision and behaviour and analysing crowd dynamics

    AttnGAN: Fine-Grained Text to Image Generation with Attentional Generative Adversarial Networks

    Full text link
    In this paper, we propose an Attentional Generative Adversarial Network (AttnGAN) that allows attention-driven, multi-stage refinement for fine-grained text-to-image generation. With a novel attentional generative network, the AttnGAN can synthesize fine-grained details at different subregions of the image by paying attentions to the relevant words in the natural language description. In addition, a deep attentional multimodal similarity model is proposed to compute a fine-grained image-text matching loss for training the generator. The proposed AttnGAN significantly outperforms the previous state of the art, boosting the best reported inception score by 14.14% on the CUB dataset and 170.25% on the more challenging COCO dataset. A detailed analysis is also performed by visualizing the attention layers of the AttnGAN. It for the first time shows that the layered attentional GAN is able to automatically select the condition at the word level for generating different parts of the image

    A Monte-Carlo-Based Network Method for Source Positioning in Bioluminescence Tomography

    Get PDF
    We present an approach based on the improved Levenberg Marquardt (LM) algorithm of backpropagation (BP) neural network to estimate the light source position in bioluminescent imaging. For solving the forward problem, the table-based random sampling algorithm (TBRS), a fast Monte Carlo simulation method we developed before, is employed here. Result shows that BP is an effective method to position the light source
    corecore